منابع مشابه
Efficient Token-Based Control in Rings
In this paper we deal with the efficiency of token-based strategies for the basic problem of controlling the allocation of a shared resource in a ring of n processing entities. We propose new protocols that allow a bounded number of exchanged messages per access request to the resource, while this amount is unbounded for classical solutions. We also guarantee all the requests to be served withi...
متن کاملStability of token passing rings
Wojciech SzpankowsklDepartment of Computer Science Purdue University W. Lafayette, IN 47907 U.S.A. The stability condition for the standard token passing ring is "known" since the seminal paper of Kuehn in 1979. However, this condition was derived without formal proof, and the proof seems to be of considerable interest to research community. In fact, Watson observed that in the performance eval...
متن کاملStability of token passing rings
A sufficient stability condition for the standard token passing ring has been "known" since the seminal paper by Kuehn in 1979. However, this condition was derived without formal proof, and the proof seems to be of considerable interest to the research community. In fact, Watson observed that in the performance evaluation of token passing rings, "it is convenient to derive stability conditions....
متن کاملGroup Mutual Exclusion in Token Rings
The group mutual exclusion (GME) problem was introduced by Joung [6]. The GME solution allows n processes to share m mutually exclusive resources. We first present a group mutual exclusion algorithm (Algorithm GME ) for anonymous token rings. The space requirement and the size of messages of this algorithm depend only on the number of shared resources (O(logm) bits). So, the proposed algorithm ...
متن کاملToken Based Group Mutual Exclusion for Asynchronous Rings
The mutual exclusion and concurrency are among the fundamental problems of distributed systems. The mutual exclusion ensures an exclusive access to a shared resource among a set of processes. The concurrency allows some processes to share a resource. The group mutual exclusion (GME) problem [1] deals with both mutual exclusion and concurrency. The GME solution allows n processes to share m mutu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 1998
ISSN: 0020-0190
DOI: 10.1016/s0020-0190(98)00054-4